A Consensus Approach to Distributed Convex Optimization in Multi-Agent Systems

In this thesis we address the problem of distributed unconstrained convex optimization under separability assumptions, i.e., the framework where a network of agents, each endowed with local private convex cost and subject to communication constraints, wants to collaborate to compute the minimizer of the sum of the local costs. We propose a design methodology that combines average consensus algorithms and separation of time-scales ideas. This strategy is proven, under suitable hypotheses, to be globally convergent to the true minimizer. Intuitively, the procedure lets the agents distributedly compute and sequentially update an approximated Newton-Raphson direction by means of suitable average consensus ratios. We consider both a scalar and a multidimensional scenario of the Synchronous Newton-Raphson Consensus, proposing some alternative strategies which trade-off communication and computational requirements with convergence speed. We provide analytical proofs of convergence and we show with numerical simulations that the speed of convergence of this strategy is comparable with alternative optimization strategies such as the Alternating Direction Method of Multipliers, the Distributed Subgradient Method and Distributed Control Method. Moreover, we consider the convergence rates of the Synchronous Newton-Raphson Consensus and the Gradient Descent Consensus under the simplificative assumption of quadratic local cost functions. We derive sufficient conditions which guarantee the convergence of the algorithms. From these conditions we then obtain closed form expressions that can be used to tune the parameters for maximizing the rate of convergence. Despite these formulas have been derived under quadratic local cost functions assumptions, they can be used as rules-of-thumb for tuning the parameters of the algorithms. Finally, we propose an asynchronous version of the Newton-Raphson Consensus. Beside having low computational complexity, low communication requirements and being interpretable as a distributed Newton-Raphson algorithm, the technique has also the beneficial properties of requiring very little coordination and naturally supporting time-varying topologies. Again, we analytically prove that under some assumptions it shows either local or global convergence properties. Through numerical simulations we corroborate these results and we compare the performance of the Asynchronous Newton-Raphson Consensus with other distributed optimization methods

Newton-Raphson Consensus for Distributed Convex Optimization

We address the problem of distributed uncon- strained convex optimization under separability assumptions, i.e., the framework where each agent of a network is endowed with a local private multidimensional convex cost, is subject to communication constraints, and wants to collaborate to compute the minimizer of the sum of the local costs. We propose a design methodology that combines average consensus algorithms and separation of time-scales ideas. This strategy is proved, under suitable hypotheses, to be globally convergent to the true minimizer. Intuitively, the procedure lets the agents distributedly compute and sequentially update an approximated Newton- Raphson direction by means of suitable average consensus ratios. We show with numerical simulations that the speed of convergence of this strategy is comparable with alternative optimization strategies such as the Alternating Direction Method of Multipliers. Finally, we propose some alternative strategies which trade-off communication and computational requirements with convergence speed.Comment: 18 pages, preprint with proof

Intergenerational altruism and house prices: evidence from bequest tax reforms in Italy

We identify the degree of intergenerational altruism in an OLG framework à la Barro exploiting the quasi-experimental variation generated by reforms of bequest taxation (estate or inheritance tax, in the U.S.) and taxes on inter vivos real estate donations (gift tax, in the U.S.) that were enacted in Italy between 2000 and 2001. Employing a unique data set containing information on the housing stock and house prices in 13 large Italian cities between 1993 and 2004, we identify the structural parameter of interest via the effect of changes in the tax rate on house prices. We find that the intergenerational altruism parameter is about 20%. Given the possible anticipation of the reform this estimate should be interpreted as a lower bound

Cognition-Based Networks: A New Perspective on Network Optimization Using Learning and Distributed Intelligence

IEEE Access Volume 3, 2015, Article number 7217798, Pages 1512-1530 Open Access Cognition-based networks: A new perspective on network optimization using learning and distributed intelligence (Article) Zorzi, M.a , Zanella, A.a, Testolin, A.b, De Filippo De Grazia, M.b, Zorzi, M.bc a Department of Information Engineering, University of Padua, Padua, Italy b Department of General Psychology, University of Padua, Padua, Italy c IRCCS San Camillo Foundation, Venice-Lido, Italy View additional affiliations View references (107) Abstract In response to the new challenges in the design and operation of communication networks, and taking inspiration from how living beings deal with complexity and scalability, in this paper we introduce an innovative system concept called COgnition-BAsed NETworkS (COBANETS). The proposed approach develops around the systematic application of advanced machine learning techniques and, in particular, unsupervised deep learning and probabilistic generative models for system-wide learning, modeling, optimization, and data representation. Moreover, in COBANETS, we propose to combine this learning architecture with the emerging network virtualization paradigms, which make it possible to actuate automatic optimization and reconfiguration strategies at the system level, thus fully unleashing the potential of the learning approach. Compared with the past and current research efforts in this area, the technical approach outlined in this paper is deeply interdisciplinary and more comprehensive, calling for the synergic combination of expertise of computer scientists, communications and networking engineers, and cognitive scientists, with the ultimate aim of breaking new ground through a profound rethinking of how the modern understanding of cognition can be used in the management and optimization of telecommunication network

An explainable model of host genetic interactions linked to COVID-19 severity

We employed a multifaceted computational strategy to identify the genetic factors contributing to increased risk of severe COVID-19 infection from a Whole Exome Sequencing (WES) dataset of a cohort of 2000 Italian patients. We coupled a stratified k-fold screening, to rank variants more associated with severity, with the training of multiple supervised classifiers, to predict severity based on screened features. Feature importance analysis from tree-based models allowed us to identify 16 variants with the highest support which, together with age and gender covariates, were found to be most predictive of COVID-19 severity. When tested on a follow-up cohort, our ensemble of models predicted severity with high accuracy (ACC = 81.88%; AUCROC = 96%; MCC = 61.55%). Our model recapitulated a vast literature of emerging molecular mechanisms and genetic factors linked to COVID-19 response and extends previous landmark Genome-Wide Association Studies (GWAS). It revealed a network of interplaying genetic signatures converging on established immune system and inflammatory processes linked to viral infection response. It also identified additional processes cross-talking with immune pathways, such as GPCR signaling, which might offer additional opportunities for therapeutic intervention and patient stratification. Publicly available PheWAS datasets revealed that several variants were significantly associated with phenotypic traits such as "Respiratory or thoracic disease", supporting their link with COVID-19 severity outcome.A multifaceted computational strategy identifies 16 genetic variants contributing to increased risk of severe COVID-19 infection from a Whole Exome Sequencing dataset of a cohort of Italian patients

Carriers of ADAMTS13 Rare Variants Are at High Risk of Life-Threatening COVID-19

Thrombosis of small and large vessels is reported as a key player in COVID-19 severity. However, host genetic determinants of this susceptibility are still unclear. Congenital Thrombotic Thrombocytopenic Purpura is a severe autosomal recessive disorder characterized by uncleaved ultra-large vWF and thrombotic microangiopathy, frequently triggered by infections. Carriers are reported to be asymptomatic. Exome analysis of about 3000 SARS-CoV-2 infected subjects of different severities, belonging to the GEN-COVID cohort, revealed the specific role of vWF cleaving enzyme ADAMTS13 (A disintegrin-like and metalloprotease with thrombospondin type 1 motif, 13). We report here that ultra-rare variants in a heterozygous state lead to a rare form of COVID-19 characterized by hyper-inflammation signs, which segregates in families as an autosomal dominant disorder conditioned by SARS-CoV-2 infection, sex, and age. This has clinical relevance due to the availability of drugs such as Caplacizumab, which inhibits vWF-platelet interaction, and Crizanlizumab, which, by inhibiting P-selectin binding to its ligands, prevents leukocyte recruitment and platelet aggregation at the site of vascular damage

Gain- and Loss-of-Function CFTR Alleles Are Associated with COVID-19 Clinical Outcomes

Carriers of single pathogenic variants of the CFTR (cystic fibrosis transmembrane conductance regulator) gene have a higher risk of severe COVID-19 and 14-day death. The machine learning post-Mendelian model pinpointed CFTR as a bidirectional modulator of COVID-19 outcomes. Here, we demonstrate that the rare complex allele [G576V;R668C] is associated with a milder disease via a gain-of-function mechanism. Conversely, CFTR ultra-rare alleles with reduced function are associated with disease severity either alone (dominant disorder) or with another hypomorphic allele in the second chromosome (recessive disorder) with a global residual CFTR activity between 50 to 91%. Furthermore, we characterized novel CFTR complex alleles, including [A238V;F508del], [R74W;D1270N;V201M], [I1027T;F508del], [I506V;D1168G], and simple alleles, including R347C, F1052V, Y625N, I328V, K68E, A309D, A252T, G542*, V562I, R1066H, I506V, I807M, which lead to a reduced CFTR function and thus, to more severe COVID-19. In conclusion, CFTR genetic analysis is an important tool in identifying patients at risk of severe COVID-19